Increasing the gap between descriptional complexity and algorithmic probability
نویسندگان
چکیده
منابع مشابه
On the descriptional and algorithmic complexity of regular languages
Gedruckt auf alterungsbeständigem Papier nach ISO 9706 (säure-, holz-und chlorfrei). Digital ist besser Tocotronic vi Preface This thesis is a research monograph. As such, it targets at an audience of experts, primarily in the fields of foundations of computer science and discrete mathematics. Nevertheless, already several persons showed interest in understanding at least the main theme of this...
متن کاملProbability, algorithmic complexity, and subjective randomness
We present a statistical account of human randomness judgments that uses the idea of algorithmic complexity. We show that an existing measure of the randomness of a sequence corresponds to the assumption that non-random sequences are generated by a particular probabilistic finite state automaton, and use this as the basis for an account that evaluates randomness in terms of the length of progra...
متن کاملInto the Breech: The Increasing Gap between Algorithmic Trading and Securities Regulation
A seismic shift is taking place in the United States securities markets. The fault lines have been present for quite some time; however, it is only now, in the last few years that the ramifications of these displacements have been felt. The traditional approach to investing has gone from a focus on investing – namely examining companies to determine whether they will be a good long-term investm...
متن کاملParikh's Theorem and Descriptional Complexity
This thesis was carried out in the Laboratorio di Linguaggi e Combinatoria (LIN.COM), at the Dipartimento di Informatica e Comunicazione, Università degli Studi di Milano. The thesis deals with some topics in the theory of formal languages, and specifically with the theory of context-free languages and the study of theirs descriptional complexity. The descriptional complexity of a formal struct...
متن کاملExpanded and improved proof of the relation between description complexity and algorithmic probability
This manuscript defines monotonic description complexity and algorithmic probability, and then gives a proof that the former is not within an additive constant of the logarithm of the latter. It is a more detailed exposition of the proof given in the original paper, and also incorporates Adam Day’s ideas that led to an improved lower bound for the binary case.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 2011
ISSN: 0002-9947,1088-6850
DOI: 10.1090/s0002-9947-2011-05315-8